some new results on semi fully fuzzy linear programming problems

there are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. the first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. the second method, named as fuzzy dual simplex method, assumes an initial dual basic feasible solution is at hand. in this paper, the shortcomings of these methods are pointed out and to overcome these shortcomings, a new method is proposed to determine the fuzzy optimal solution of such fuzzy problems. the advantages of the proposed method over existing methods are discussed. to illustrate the proposed method a numerical example is solved by using the proposed method and the obtained results are discussed.